LISP Program - Size Complexity II
نویسنده
چکیده
We present the information-theoretic incompleteness theorems that arise in a theory of program-size complexity based on something close to real LISP. The complexity of a formal axiomatic system is defined to be the minimum size in characters of a LISP definition of the proofchecking function associated with the formal system. Using this concrete and easy to understand definition, we show (a) that it is difficult to exhibit complex S-expressions, and (b) that it is difficult to determine the bits of the LISP halting probability ΩLISP. We also construct improved versions ΩLISP and Ω ′′ LISP of the LISP halting probability that asymptotically have maximum possible LISP complexity. Copyright c © 1992, Elsevier Science Publishing Co., Inc., reprinted by permission.
منابع مشابه
Some Rules For The Automatic Synthesis Of Programs
A set of rules (or facts) about program synthesis is presented. The rules are about the process of programming, and are sutficient for the synthesis of an insertion sort program. The use of the rules to write a short LISP program is described. Taken together, the rules are an embodiment of a detailed theory which explains one small part of the programming process. The size of the set of rules s...
متن کاملReverse Engineering Techniques for Lisp Systems
Reverse engineering software systems, especially large legacy systems, is a difficult task, because of the sheer size and complexity of the systems. Many approaches have been developed to analyze software systems written in different languages. These approaches employ vary techniques like metrics or visualizations, and typically rely on parsing the system and on extracting a model that conforms...
متن کاملAn Automatic Program Generator for Multi-Level Specialization
Program specialization can divide a computation into several computation stages. This paper investigates the theoretical limitations and practical problems of standard specialization tools, presents multi-level specialization, and demonstrates that, in combination with the cogen approach, it is far more practical than previously supposed. The program generator which we designed and implemented ...
متن کاملGenetic Programming Estimates of Kolmogorov Complexity
In this paper the problem of the Kolmogorov complexity related to binary strings is faced. We propose a Genetic Programming approach which consists in evolving a population of Lisp programs looking for the optimal program that generates a given string. This evolutionary approach has permited to overcome the intractable space and time diiculties occurring in methods which perform an approximatio...
متن کاملTerm Project CS 591 . 003 Fall 02 UNM
This report describes the design and results of a series of experiments in complexity in physics and critical phenomena. Experiments included the following: 1. Ising model simulations where the critical temperature of the phase transition and the correlation length were measured on 2D lattices. 2. Percolation simulations implented using the union find algorithm that estimate the size of the gia...
متن کامل